New Formulations for the Team Orienteering Problem

The Team Orienteering Problem: Formulations and Branch-Cut and Price

The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical vehicles, with a limited total duration for their routes, is given. The total profit gathered by all routes is to be maximized. We devise an extended formulation where edges are indexed by the time they are placed in the r...

Metaheuristics for the team orienteering problem

The Team Orienteering Arc Routing Problem

The Team Orienteering Arc Routing Problem (TOARP) is the extension to the arc routing setting of the Team Orienteering Problem (TOP). In the TOARP a set of potential customers, each associated with an arc of a directed graph, is available and a profit is collected when a potential customer is served that is when the associated arc is traversed. A fleet of vehicles is available to visit the cust...

The split delivery capacitated team orienteering problem

In this paper we study the capacitated team orienteering problem where split deliveries are allowed. A set of potential customers is given, each associated with a demand and a profit. The set of customers to be served by a fleet of capacitated vehicles has to be identified in such a way that the profit collected is maximized, while satisfying constraints on the maximum time duration of each rou...

Team Orienteering Problem with Decreasing Profits

Team Orienteering with Decreasing Profits (DP-TOP) extends the classical Team Orienteering problem (TOP) by considering the profit of each client as a decreasing function of time. It consists of maximizing the sum of collected profit by a fixed number K of vehicles, visiting each client at most once. In this work, we present lower bounds based on a Dantzig-Wolfe decomposition and column generat...